Connectivity of the k-Out Hypercube
نویسندگان
چکیده
منابع مشابه
Hypercube Connectivity within ccNUMA Architecture
The Silicon Graphics Origin2000TM and Onyx2TM systems are structured to fit a customer’s specific applications and problem sizes. This is accomplished with the company’s ccNUMA (cache coherent non-uniform memory access) architecture, which can link multitudes of processors together in such a way that the number of interconnections scales with the growth of the system, avoiding the bandwidth lim...
متن کاملConnectivity of Matching Graph of Hypercube
The matching graph M(G) of a graph G has a vertex set of all perfect matchings of G, with two vertices being adjacent whenever the union of the corresponding perfect matchings forms a Hamiltonian cycle. We prove that the matching graph M(Qd) of the d-dimensional hypercube is bipartite and connected for d ≥ 4. This proves Kreweras’ conjecture [2] that the graph Md is connected, where Md is obtai...
متن کاملExtra edge connectivity of hypercube-like networks
Taylor & Francis makes every effort to ensure the accuracy of all the information (the “Content”) contained in the publications on our platform. However, Taylor & Francis, our agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the Content. Any opinions and views expressed in this publication are the opin...
متن کاملDispersive Ordering and k-out-of-n Systems
Extended Abstract. The simplest and the most common way of comparing two random variables is through their means and variances. It may happen that in some cases the median of X is larger than that of Y, while the mean of X is smaller than the mean of Y. However, this confusion will not arise if the random variables are stochastically ordered. Similarly, the same may happen if one would like to ...
متن کاملA zero-one law for k-connectivity in Random K-out graphs intersecting Erdős-Rényi Graphs
We investigate k-connectivity in secure wireless sensor networks under the random pairwise key predistribution scheme with unreliable links; a network is said to be kconnected if it remains connected despite the failure of any of its (k − 1) nodes or links. With wireless communication links modeled as independent on-off channels, this amounts to analyzing a random graph model formed by intersec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1134226